Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks

Bounds and error bounds for queueing networks

Queueing networks are an important means to model and evaluate a variety of practical systems. Unfortunately, analytic results are often not available. Numerical computation may then have to be employed. Or, system modifications might be suggested to obtain simple bounds or computationally easy approximations. Formal analytic support for the accuaracy or nature of such modifications or approxim...

Performance Analysis of Closed Queueing Networks - ReadingSample

Perfect Sampling for Multiclass Closed Queueing Networks

In this paper we present an exact sampling method for multiclass closed queuing networks. We consider networks for which stationary distribution does not necessarily have a product form. The proposed method uses a compact representation of sets of states, that is used to derive a bounding chain with significantly lower complexity of one-step transition in the coupling from the past scheme. The ...

Perfect sampling for closed queueing networks

In this paper we investigate coupling from the past (CFTP) algorithms for closed queueing networks. The stationary distribution has a product form only in a very limited number of particular cases when queue capacity is nite, and numerical algorithms are intractable due to the cardinality of the state space. Moreover, closed networks do not exhibit any monotonic property enabling e cient CFTP. ...

Robust Box Bounds: Throughput Guarantees for Closed Multiclass Queueing Networks with Minimal Stochastic Assumptions

To use queueing theory to analyze real systems such as computer communications networks, we make assumptions that are strictly speaking untrue. The problem is especially severe for multiclass networks with FIFO service and greatly diiering service times. This paper provides an exact analysis for bounds, for cases with greatly relaxed assumptions. Service times can have general (IFR) distributio...